LTI Agent Rescue: A Partial Global Approach for the RoboCup Rescue Task Allocation
نویسندگان
چکیده
Coordenação é um dos principais problemas em sistemas multiagentes, além de também desempenhar um papel essencial na gestão de desastres. A alocação de tarefas é uma fase importante do problema de coordenação, já que a decomposição de um objetivo em tarefas é a forma mais natural para se organizar o trabalho entre agentes. Nesse artigo, é proposta uma abordagem híbrida de alocação de tarefas para coordenar os agentes na RoboCup Rescue Agent Simulation, que considera a existência de informações locais e globais. Além disso, é apresentada uma metodologia para a análise comparativa entre times de agentes, que é aplicada na comparação dos resultados obtidos pelo time LTI Agent Rescue, que utiliza a abordagem proposta, com os resultados obtidos por outros times de agentes que implementam abordagens distintas para solucionar o problema da coordenação. Abstract: Coordination is one of the key issues in multiagent systems and it also plays an essential role in disaster management. Task allocation is an important phase of the coordination problem, since the decomposition of the objective into tasks is the most natural way to organize work among agents. In this paper, we propose a hybrid task allocation approach to coordinate the agents in the RoboCup Rescue Agent Simulation that considers the existence of both local and global information. Moreover, we provide a methodology to compare agent team results, that is used to compare the results of the LTI Agent Rescue team, which uses the proposed approach, with the results of other rescue agent teams that implement different approaches to solve the coordination problem. Coordination is one of the key issues in multiagent systems and it also plays an essential role in disaster management. Task allocation is an important phase of the coordination problem, since the decomposition of the objective into tasks is the most natural way to organize work among agents. In this paper, we propose a hybrid task allocation approach to coordinate the agents in the RoboCup Rescue Agent Simulation that considers the existence of both local and global information. Moreover, we provide a methodology to compare agent team results, that is used to compare the results of the LTI Agent Rescue team, which uses the proposed approach, with the results of other rescue agent teams that implement different approaches to solve the coordination problem.
منابع مشابه
Multi-agent Planning for the RoboCup Rescue Simulation - Applying Clustering into Task Allocation and Coordination
The RoboCup Rescue Simulation system provides a rich environment for developing novel techniques for multi-agent systems. The simulation provides a city map modeled as buildings and roads with civilians amongst them. A disaster scenario is simulated causing buildings to catch fire, roads to get blocked, and civilians to get injured and/or buried. The main goal is to use the available emergency ...
متن کاملGoal programming-based post-disaster decision making for allocation and scheduling the rescue units in natural disaster with time-window
Natural disasters, such as earthquakes, tsunamis, and hurricanes cause enormous harm during each year. To reduce casualties and economic losses in the response phase, rescue units must be allocated and scheduled efficiently, such that it is a key issues in emergency response. In this paper, a multi-objective mix integer nonlinear programming model (MOMINLP) is proposed to minimize sum of weight...
متن کاملBinary max-sum for multi-team task allocation in RoboCup Rescue
Coordination of agents involved in rescue missions is an important open research problem. We focus on the RoboCup Rescue Simulation (RCS) challenge, where different teams of agents perform urban rescue operations. Previous approaches typically cast such coordination problem as separate single-team allocation problems, and solve them separately. Our first key contribution is to focus on the max-...
متن کاملEffective Multi-robot Spatial Task Allocation Using Model Approximations
Real-world multi-agent planning problems cannot be solved using decision-theoretic planning methods due to the exponential complexity. We approximate firefighting in rescue simulation as a spatially distributed task and model with multi-agent Markov decision process. We use recent approximation methods for spatial task problems to reduce the model complexity. Our approximations are single-agent...
متن کاملReverse Combinatorial Auctions for Resource Allocation in the Rescue Scenario
In a disaster environment no single agent knows the disaster situation completely. So, rescue agents share their information in order to identify rescue tasks that are then allocated. In this paper we model the allocation problem as a reverse combinatorial auction and we apply some existing algorithms to solve it. Our results have been compared with the RoboCup classification of 2005.
متن کامل